Clique-gated graphs
نویسندگان
چکیده
منابع مشابه
Clique-gated graphs
Clique-gated graphs form an extension of quasi-median graphs. Two characterizations of these graphs are given and some other structural properties are obtained. An O(nm) algorithm is presented which recognizes clique-gated graphs. Here n and m denote the numbers of vertices and edges of a given graph, respectively.
متن کاملOn hereditary clique-Helly self-clique graphs
A graph is clique-Helly if any family of mutually intersecting (maximal) cliques has non-empty intersection, and it is hereditary clique-Helly (abbreviated HCH) if its induced subgraphs are clique-Helly. The clique graph of a graph G is the intersection graph of its cliques, and G is self-clique if it is connected and isomorphic to its clique graph. We show that every HCH graph is an induced su...
متن کاملSelf-clique Graphs with Prescribed Clique-sizes
The clique graph of a graph G is the intersection graph K(G) of the (maximal) cliques of G. A graph G is called self-clique whenever G ∼= K(G). This paper gives various constructions of self-clique graphs. In particular, we employ (r, g)-cages to construct self-clique graphs whose set of clique-sizes is any given finite set of integers greater than 1.
متن کاملClique numbers of graphs
Many graph-theoretical problems involve the study of cliques, i .e ., complete subgraphs (not necessarily maximal) . In this context the following combinatorial problem arises naturally: For which numbers n and c is there a graph with n vertices and exactly c cliques? For fixed n, let G(n) denote the set of all such `clique numbers' c . Since each singleton and the empty set are always cliques,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1996
ISSN: 0012-365X
DOI: 10.1016/0012-365x(95)00280-a